On condition numbers of polynomial eigenvalue problems
نویسندگان
چکیده
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition numbers of eigenvalues and the pseudospectral growth rate. We obtain that if a simple eigenvalue of a matrix polynomial is ill-conditioned in some respects, then it is close to be multiple, and we construct an upper bound for this distance (measured in the euclidean norm). We also derive a new expression for the condition number of a simple eigenvalue, which does not involve eigenvectors. Moreover, an Elsner-like perturbation bound for matrix polynomials is presented.
منابع مشابه
On condition numbers of polynomial eigenvalue problems with nonsingular leading coefficients
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix perturbation theory. We provide a relation between the condition numbers of eigenvalues and the pseudospectral growth rate. We obtain that if a simple eigenvalue of a matrix polynomial is ill-conditioned in some respects, th...
متن کاملPerturbation Theory for HomogeneousPolynomial Eigenvalue
We consider polynomial eigenvalue problems P(A; ;)x = 0 in which the matrix polynomial is homogeneous in the eigenvalue (;) 2 C 2. In this framework innnite eigenvalues are on the same footing as nite eigenvalues. We view the problem in projective spaces to avoid normalization of the eigenpairs. We show that a polynomial eigenvalue problem is well-posed when its eigenvalues are simple. We deene...
متن کاملStructured Hölder Condition Numbers for Multiple Eigenvalues
The sensitivity of a multiple eigenvalue of a matrix under perturbations can be measured by its Hölder condition number. Various extensions of this concept are considered. A meaningful notion of structured Hölder condition numbers is introduced and it is shown that many existing results on structured condition numbers for simple eigenvalues carry over to multiple eigenvalues. The structures inv...
متن کاملPerturbation theory for homogeneous polynomial eigenvalue problems
We consider polynomial eigenvalue problems P(A, α, β)x = 0 in which the matrix polynomial is homogeneous in the eigenvalue (α, β) ∈ C2. In this framework infinite eigenvalues are on the same footing as finite eigenvalues. We view the problem in projective spaces to avoid normalization of the eigenpairs. We show that a polynomial eigenvalue problem is wellposed when its eigenvalues are simple. W...
متن کاملStructured eigenvalue condition numbers and linearizations for matrix polynomials
This work is concerned with eigenvalue problems for structured matrix polynomials, including complex symmetric, Hermitian, even, odd, palindromic, and anti-palindromic matrix polynomials. Most numerical approaches to solving such eigenvalue problems proceed by linearizing the matrix polynomial into a matrix pencil of larger size. Recently, linearizations have been classified for which the penci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Applied Mathematics and Computation
دوره 216 شماره
صفحات -
تاریخ انتشار 2010